- input size
- Программирование: размер входных данных (зависит от рассматриваемой задачи)
Универсальный англо-русский словарь. Академик.ру. 2011.
input size
Смотреть что такое "input size" в других словарях:
input controls — management restrictions placed on the amount of effort input into a fishery, e.g. by restricting types and size of fishing gear and boats and the amount of fishing time … Dictionary of ichthyology
Problem size — In the fields of algorithm analysis and computational complexity theory, the running time or space requirements of an algorithm are expressed as a function of the problem size. The problem size measures the size, in some sense, of the input to… … Wikipedia
C file input/output — C Standard Library Data types Character classification Strings Mathematics File input/output Date/time Localiza … Wikipedia
Block size (cryptography) — In modern cryptography, symmetric key ciphers are generally divided into stream ciphers and block ciphers. Block ciphers operate on a fixed length string of bits. The length of this bit string is the block size. Both the input (plaintext) and… … Wikipedia
Prefetch input queue — Most modern processors load their instructions some clock cycles before they execute them. This is achieved by pre loading machine code from memory into a prefetch input queue (PIQ).This behavior only applies to von Neumann computers (that is,… … Wikipedia
Phono input — The phono input is a set of RCA input jacks, usually behind a stereo receiver to which a phonograph or turntable is attached. Modern phonograph needles and phono cartridges output a very low level signal, which is input to the receiver then… … Wikipedia
Working Set Size — In computing the working set size is the amount of memory needed to compute the answer to a problem. In any computing scenario, but especially high performance computing where mistakes can be costly, this is a significant design criteria for a… … Wikipedia
List of Internet exchange points by size — This is a list of Internet Exchange Points by size (of overall throughput), with additional data on location, establishment and average throughput.The list has been compiled on 21 July 2007 by sampling the maximum and average input numbers for… … Wikipedia
Time complexity — In computer science, the time complexity of an algorithm quantifies the amount of time taken by an algorithm to run as a function of the size of the input to the problem. The time complexity of an algorithm is commonly expressed using big O… … Wikipedia
Computational complexity theory — is a branch of the theory of computation in theoretical computer science and mathematics that focuses on classifying computational problems according to their inherent difficulty, and relating those classes to each other. In this context, a… … Wikipedia
Clique problem — The brute force algorithm finds a 4 clique in this 7 vertex graph (the complement of the 7 vertex path graph) by systematically checking all C(7,4)=35 4 vertex subgraphs for completeness. In computer science, the clique problem refers to any of… … Wikipedia
